#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include "tree.h"

using namespace std;

int getDiameterHelper(Tree *root, int &h)
{
    if (!root) {
        h = 0;
        return 0;    
    }
    int lh = 0, rh = 0;
    int ld = getDiameterHelper(root->left, lh);
    int rd = getDiameterHelper(root->right, rh);
    h = max(lh, rh)+1;
    return max(1+lh+rh, max(ld,rd));
}


int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }

    print_ascii_tree(root);
    int h = 0;
    result = getDiameterHelper(root, h);
    cout <<"Max diameter of the tree is " << result << endl;
}
